Bounding the Range of a Rational Function over a box
نویسندگان
چکیده
A simple method is presented by which tight bounds on the range of a multivariate rational function over a box can be computed. The approach relies on the expansion of the numerator and denominator polynomials into Bernstein polynomials.
منابع مشابه
Bounding the Range of a Rational
A simple method is presented by which tight bounds on the range of a multivariate rational function over a box can be computed. The approach relies on the expansion of the numerator and denominator polynomials into Bernstein polynomials.
متن کاملComplete characterization of the Mordell-Weil group of some families of elliptic curves
The Mordell-Weil theorem states that the group of rational points on an elliptic curve over the rational numbers is a finitely generated abelian group. In our previous paper, H. Daghigh, and S. Didari, On the elliptic curves of the form $ y^2=x^3-3px$, Bull. Iranian Math. Soc. 40 (2014), no. 5, 1119--1133., using Selmer groups, we have shown that for a prime $p...
متن کاملData Structures for Range-Aggregation over Categories
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles) in IR, d ≥ 1 such that given a query orthogonal range q (e.g. hyperbox/point), we can report efficiently for each distinct color c of the points in S ∩ q, the tuple 〈 c, F(c) 〉 where F(c) is a function (e.g. weighted...
متن کاملAutomatic Bounding Estimation in Modified Nlms Algorithm
Modified Normalized Least Mean Square (MNLMS) algorithm, which is a sign form of NLMS based on set-membership (SM) theory in the class of optimal bounding ellipsoid (OBE) algorithms, requires a priori knowledge of error bounds that is unknown in most applications. In a special but popular case of measurement noise, a simple algorithm has been proposed. With some simulation examples the performa...
متن کاملData Structures for Range Aggregation by Categories
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles) in R, d ≥ 1 such that given a query orthogonal range q, we can report efficiently for each distinct color c of the points in S∩q, the tuple < c,F(c) > where F(c) is a function (e.g. weighted sum, bounding box etc.) o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Reliable Computing
دوره 17 شماره
صفحات -
تاریخ انتشار 2012